Horton Self-similarity of Kingman’s Coalescent Tree
نویسنده
چکیده
The paper establishes Horton self-similarity for a tree representation of Kingman’s coalescent process. The proof is based on a Smoluchowski-type system of ordinary differential equations that describes evolution of the number of branches of a given HortonStrahler order in a tree that represents Kingman’s N -coalescent, in a hydrodynamic limit. We also demonstrate a close connection between the combinatorial Kingman’s tree and the combinatorial level set tree of a white noise, which implies Horton self-similarity for the latter.
منابع مشابه
Binary to Bushy: Bayesian Hierarchical Clustering with the Beta Coalescent
Discovering hierarchical regularities in data is a key problem in interacting with large datasets, modeling cognition, and encoding knowledge. A previous Bayesian solution—Kingman’s coalescent—provides a probabilistic model for data represented as a binary tree. Unfortunately, this is inappropriate for data better described by bushier trees. We generalize an existing belief propagation framewor...
متن کاملTokunaga and Horton self-similarity for level set trees of Markov chains
The Horton and Tokunaga branching laws provide a convenient framework for studying self-similarity in random trees. The Horton self-similarity is a weaker property that addresses the principal branching in a tree; it is a counterpart of the power-law size distribution for elements of a branching system. The stronger Tokunaga self-similarity addresses so-called side branching. The Horton and Tok...
متن کاملThe tree length of an evolving coalescent
A well-established model for the genealogy of a large population in equilibrium is Kingman’s coalescent. For the population together with its genealogy evolving in time, this gives rise to a time-stationary tree-valued process. We study the sum of the branch lengths, briefly denoted as tree length, and prove that the (suitably compensated) sequence of tree length processes converges, as the pop...
متن کاملKingman’s coalescent and Brownian motion
We describe a simple construction of Kingman’s coalescent in terms of a Brownian excursion. This construction is closely related to, and sheds some new light on, earlier work by Aldous (1998) and Warren (1999). Our approach also yields some new results: for instance, we obtain the full multifractal spectrum of Kingman’s coalescent. This complements earlier work on Beta-coalescents by Berestycki...
متن کاملInference in Kingman's Coalescent with Particle Markov Chain Monte Carlo Method
We propose a new algorithm to do posterior sampling of Kingman’s coalescent, based upon the Particle Markov Chain Monte Carlo methodology. Specifically, the algorithm is an instantiation of the Particle Gibbs Sampling method, which alternately samples coalescent times conditioned on coalescent tree structures, and tree structures conditioned on coalescent times via the conditional Sequential Mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016